How Many Entries of A Typical Orthogonal Matrix Can Be Approximated By Independent Normals? Short title: Normals Approximate Matrix Entries

We solve an open problem of Diaconis that asks what are the largest orders of pn and qn such that Zn, the pn× qn upper left block of a random matrix Γn which is uniformly distributed on the orthogonal group O(n), can be approximated by independent standard normals? This problem is solved by two different approximation methods. First, we show that the variation distance between the joint distribution of entries of Zn and that of pnqn independent standard normals goes to zero provided pn = o( √ n) and qn = o( √ n). We also show that the above variation distance does not go to zero if pn = [x √ n] and qn = [y √ n] for any positive numbers x and y. This says that the largest orders of pn and qn are o(n 1/2) in the sense of the above approximation. Second, suppose Γn = (γij)n×n is generated by performing the Gram-Schmidt algorithm on the columns of Yn = (yij)n×n where {yij ; 1 ≤ i, j ≤ n} are i.i.d. standard normals. We show that ǫn(m) := max1≤i≤n,1≤j≤m | √ nγij − yij| goes to zero in probability as long as m = mn = o(n/ log n). We also prove that ǫn(mn) → 2 √ α in probability when mn = [nα/ log n] for any α > 0. This says that mn = o(n/ log n) is the largest order such that the entries of the first mn columns of Γn can be approximated simultaneously by independent standard normals.